DEGREE-k LINEAR RECURSIONS MOD(p) AND NUMBER FIELDS

Linear recursions of degree k are determined by evaluating the sequence of Generalized Fibonacci Polynomials, {Fk,n(t1, ..., tk)} (isobaric reflects of the complete symmetric polynomials) at the integer vectors (t1, ..., tk). If Fk,n(t1, ..., tk) = fn, then fn − k ∑ j=1 tjfn−j = 0, and {fn} is a linear recursion of degree k. On the one hand, the periodic properties of such sequences modulo a prime p are discussed, and are shown to be related to the prime structure of certain algebraic number fields; for example, the arithmetic properties of the period are shown to characterize ramification of primes in an extension field. On the other hand, the structure of the semilocal rings associated with the number field is shown to be completely determined by Schur-hook polynomials. key words: Symmetric polynomials, Schur polynomials, linear recursions, number fields. 1.INTRODUCTION A sequence {fn} is a linear recursion of degree k, denoted by [t1, ..., tk], if, given a (finite) sequence of integers t1, ..., tk, the following equation is satisfied for all n ∈ Z: